• Efficient query processing on large spatial databases: A performance study 

      Roumelis G., Vassilakopoulos M., Corral A., Manolopoulos Y. (2017)
      Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data using spatial access methods. Spatial indexes, such as those based on the Quadtree, ...
    • Nearest Neighbor Algorithms using xBR-Trees 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A. (2011)
      One of the common queries in spatial databases is the (K) Nearest Neighbor Query that discovers the (K) closest objects to a query object. Processing of spatial queries, in most cases, is accomplished by indexing spatial ...
    • Porting disk-based spatial index structures to flash-based solid state drives 

      Carniel A.C., Roumelis G., Ciferri R.R., Vassilakopoulos M., Corral A., Aguiar C.D. (2022)
      Indexing data on flash-based Solid State Drives (SSDs) is an important paradigm recently applied in spatial data management. During last years, the design of new spatial access methods for SSDs, named flash-aware spatial ...
    • Use-based optimization of Spatial access methods 

      Athanasiou N., Corral A., Vassilakopoulos M., Manolopoulos Y. (2017)
      Spatial access methods have been extensively studied in the literature, during last decades. Access methods were designed for efficient processing of demanding queries and extensive comparisons between such methods have ...
    • The xbr+-tree: An efficient access method for points 

      Roumelis G., Vassilakopoulos M., Loukopoulos T., Corral A., Manolopoulos Y. (2015)
      Spatial indexes, such as those based on Quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints. In this paper, we present improvements of the xBR-tree (a member of the ...